منابع مشابه
Priority Systems
We present a framework for the incremental construction of deadlock-free systems meeting given safety properties. The framework borrows concepts and basic results from the controller synthesis paradigm by considering a step in the construction process as a controller synthesis problem. We show that priorities are expressive enough to represent restrictions induced by deadlock-free controllers p...
متن کاملLinear and Circular Splicing Systems
We consider closure properties of classes of languages under the operation of iterated splicing. The main result is that full abstract families of languages are closed under splicing using a regular set of splicing rules. We have the same result for families of circular strings, with two extra assumptions: the languages in the abstract family must be closed under cyclic permutations and the spl...
متن کاملMarked Systems and Circular Splicing
In 1987 Head introduced a new operation on strings, called splicing, as a formal model of certain cut and paste biochemical transformation processes of an initial collection of DNA strands under the simultaneous influence of enzymes [11]. Two strands of DNA are cut at specified substrings (sites) by restriction enzymes that recognize a pattern inside the molecule and then the fragments are past...
متن کاملThe Power of Priority Channel Systems
We introduce Priority Channel Systems, a new class of channel systems where messages carry a numeric priority and where higher-priority messages can supersede lower-priority messages preceding them in the fifo communication buffers. The decidability of safety and inevitability properties is shown via the introduction of a priority embedding, a well-quasiordering that has not previously been use...
متن کاملAnalyzing Stochastic Fixed-Priority Real-Time Systems
Traditionally, real-time systems require that the deadlines of all jobs be met. For many applications, however, this is an overly stringent requirement. An occasional missed deadline may cause decreased performance but is nevertheless acceptable. We present an analysis technique by which a lower bound on the percentage of deadlines that a periodic task meets is determined and compare the lower ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Yale Law Journal
سال: 1961
ISSN: 0044-0094
DOI: 10.2307/794211